Description: matlab实现的蚁群算法（ACA）例程，解决TSP旅行商问题，可以在图中进行动态显示-ant colony algorithm matlab realized (ACA) routines to solve the traveling salesman problem TSP, can be dynamically shown in the figure Platform: |
Size: 4096 |
Author:frank |
Hits:
Description: 使用模拟退火选择路径问题，例如一个旅行商问题，给定N个城市，有一个推销员必须遍访这N个城市，而且每个城市只能访问一次最后回到出发的那个城市，要求安排合理的访问顺序，以实现访问路线最短的目标。-Select the path using the simulated annealing problems, such as a traveling salesman problem, given N cities, a salesman must have visited this N cities, and each city can only be accessed once the final return to the starting of the city, it requires reasonable arrangements the access order to achieve the shortest access route target. Platform: |
Size: 649216 |
Author:刘同学 |
Hits:
Description: 针对于多个城市的最短距离问题或旅行商问题，模拟退火算法，C#程序-For the shortest distance problem or traveling salesman problem in many cities, simulated annealing algorithm, C# program Platform: |
Size: 67584 |
Author:py |
Hits:
Description: 这个源代码是为了解决旅行商问题算法的一段代码，是用回溯法解决的。-This source code is a piece of code in order to solve the traveling salesman problem algorithm, is overcome with backtracking method. Platform: |
Size: 1024 |
Author:王文滟 |
Hits:
Description: TSP Solver is a very intuitive and user-friendly program that demonstrates two
common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory.
For a brief description of the TSP, along with a quick reference to the solution
methods addressed here, you can have a look at the TSP.pdf that is included. The
user is able to the number of the graph nodes, load random distance values
or even load or save the values to a file. He can the Heuristic Algorithm
or even the computationally unrealistic Exhaustive Algorithm. At the end of the
execution of the selected algorithm, they are shown the time in seconds and the
estimated flops (floating point operations) used for the calculation. The results
can be added to a result list and according to them, they are drawn useful graphics
that help the user to understand and study better the solution to the problem and
its results.-TSP Solver is a very intuitive and user-friendly program that demonstrates two
common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory.
For a brief description of the TSP, along with a quick reference to the solution
methods addressed here, you can have a look at the TSP.pdf that is included. The
user is able to the number of the graph nodes, load random distance values
or even load or save the values to a file. He can the Heuristic Algorithm
or even the computationally unrealistic Exhaustive Algorithm. At the end of the
execution of the selected algorithm, they are shown the time in seconds and the
estimated flops (floating point operations) used for the calculation. The results
can be added to a result list and according to them, they are drawn useful graphics
that help the user to understand and study better the solution to the problem and
its results. Platform: |
Size: 550912 |
Author:suwardee |
Hits:
Description: 包含模拟退火在旅行商问题，最大截问题，独立集问题和图着色问题的程序-Simulated Annealing included in the traveling salesman problem, the maximum cut problem, independent set problems and coloring program Platform: |
Size: 15360 |
Author:田兵 |
Hits:
Description: 蚁群算法解决旅行商最佳路径优化问题，信息素增加强度系数，最佳路线长度-Ant colony optimization algorithm to solve the traveling salesman problem the best path, increase the intensity factor pheromone, the best route length Platform: |
Size: 2048 |
Author:shihuiyang |
Hits:
Description: 利用GPU进行多线程的旅行商问题的解决方法，采用的算法为退火算法-The use of multi-threaded GPU solutions traveling salesman problem, the algorithm used for the annealing algorithm Platform: |
Size: 5761024 |
Author:黄晓航 |
Hits:
Description: 基于旅行商问题的图像拼接，可以通过提取特征值完成图像的拼接。-Traveling salesman problem based image stitching, image stitching can be done by extracting characteristic values. Platform: |
Size: 4215808 |
Author:张安祺 |
Hits:
Description: 遗传算法TSP，旅行商问题，1． 假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求所经过的路径路程尽量短。-Genetic algorithm TSP, Traveling Salesman Problem, 1. Suppose you have a traveling businessman to visit n cities, he must choose the path to go, a restricted path is visit each city only once, and the last to return to the original departure city. Select the destination path is the path requirements as short as possible. Platform: |
Size: 3072 |
Author:余家 |
Hits:
Search - traveling salesman problem